Sensitivity versus block sensitivity of Boolean functions
نویسندگان
چکیده
منابع مشابه
Sensitivity versus block sensitivity of Boolean functions
Determining the maximal separation between sensitivity and block sensitivity of Boolean functions is of interest for computational complexity theory. We construct a sequence of Boolean functions with bs(f) = 1 2 s(f) 2 + 1 2 s(f). The best known separation previously was bs(f) = 1 2 s(f) 2 due to Rubinstein. We also report results of computer search for functions with at most 12 variables.
متن کاملSensitivity block sensitivity and block sensitivity of boolean functions
Sensitivity is one of the simplest and block sensitivity one of the most useful invariants of a boolean function Nisan and Nisan and Szegedy have shown that block sensitivity is polynomially related to a number of measures of boolean function complexity The main open question is whether or not a polynomial relationship exists between sensitivity and block sensitivity We de ne the intermediate n...
متن کاملSensitivity, block sensitivity, and l-block sensitivity of boolean functions
Sensitivity is one of the simplest, and block sensitivity one of the most useful, invariants of a boolean function. Nisan [SIAM J. Comput. 20 (6) (1991) 999] and Nisan and Szegedy [Comput. Complexity 4 (4) (1994) 301] have shown that block sensitivity is polynomially related to a number of measures of boolean function complexity. Themain open question is whether or not a polynomial relationship...
متن کاملSensitivity Versus Certificate Complexity of Boolean Functions
Sensitivity, block sensitivity and certificate complexity are basic complexity measures of Boolean functions. The famous sensitivity conjecture claims that sensitivity is polynomially related to block sensitivity. However, it has been notoriously hard to obtain even exponential bounds. Since block sensitivity is known to be polynomially related to certificate complexity, an equivalent of provin...
متن کاملNoise sensitivity of Boolean functions
The notion of noise sensitivity was introduced by Benjamini, Kalai, and Schramm in 1998 [3], in the context of percolation theory. Since then noise sensitivity has found applications in many fields, including concentration of measure, social choice theory, and theoretical computer science. Say we have n people voting for one of two candidates, D or R. One can write their choices as ω = (ω(1), ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2011
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2011.02.001